A TWOOA construction for multi-receiver multi-message authentication codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A TWOOA construction for multi-receiver multi-message authentication codes

A (k, n;w) multi-receiver multi-message authentication code allows a transmitter to broadcast up to w − 1 different authenticated messages to n receivers in such a way that (1) not only an opponent but also any up to k − 1 receivers cannot cheat any other receivers, and (2) all the receivers can independently verify the authenticity of the messages. Obana and Kurosawa (Designs, Codes and Crypto...

متن کامل

New Results on Multi-Receiver Authentication Codes

Multi-receiver authentication is an extension of traditional point-to-point message authentication in which a sender broadcasts a single authenticated message such that all the receivers can independently verify the authenticity of the message, and malicious groups of up to a given size of receivers can not successfully impersonate the transmitter, or substitute a transmitted message. This pape...

متن کامل

Multi-receiver Homomorphic Authentication Codes for Network Coding

We investigate a new class of authenticate codes (A-codes) that support verification by a group of message recipients in the network coding setting. That is, a sender generates an A-code over a message such that any intermediate node or recipient can check the authenticity of the message, typically to detect pollution attacks. We call such an A-code as multi-receiver homomorphic A-code (MRHA-co...

متن کامل

A New Construction of Multi-receiver Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields

Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we constructed one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.

متن کامل

Multi-message Authentication over Noisy Channel with Secure Channel Codes

In this paper, we investigate multi-message authentication to combat adversaries with infinite computational capacity. An authentication framework over a wiretap channel (W1,W2) is proposed to achieve information-theoretic security with the same key. The proposed framework bridges the two research areas in physical (PHY) layer security: secure transmission and message authentication. Specifical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Cryptology

سال: 2008

ISSN: 1862-2976,1862-2984

DOI: 10.1515/jmc.2008.002